منابع مشابه
All-path: Finding Simply Fastest Path and Balancing Load by Flooding ARP Packets as Path Probes
Shortest path bridging overcomes the limitations of the spanning tree protocol in switched networks. Dominant approaches like Shortest Path Bridges (IEEE 802.1aq) and TRILL (IETF) Rbridges add a link state routing protocol in layer two to compute shortest paths between bridges, but these paths are shared by multiple hosts. Balancing the load at links requires complex equal cost multipath comput...
متن کاملwARP-Path: Implications of adapting the Ethernet-based ARP-Path bridging protocol to a wireless environment
The ARP-Path protocol has flourished as a promise for wired networks, creating shortest paths with the simplicity of pure bridging and competing directly with TRILL and SPB. After analyzing different alternatives of ARP-Path and creating the All-Path family, the idea of migrating the protocol to wireless networks appeared to be a good alternative to protocols such as a AODV. In this article, we...
متن کاملSecluded Path via Shortest Path
We provide several new algorithmic results for the secluded path problem, specifically approximation and optimality results for the static algorithm of [3, 5], and an extension (h-Memory) of it based on de Bruijn graphs, when applied to bounded degree graphs and some other special graph classes which can model wireless communication and line-of-sight settings. Our primary result is that h-Memor...
متن کاملShortest Path
In this lecture, we will further examine shortest path algorithms. We will first revisit Dijkstra’s algorithm and prove its correctness. Next, we will look at another shortest path algorithm known as the Bellman-Ford algorithm, that has a slower running time than Dijkstra’s but allows us to compute shortest paths on graphs with negative edge weights. Lastly, we look at an O(n3)-time algorithm f...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2011
ISSN: 1089-7798
DOI: 10.1109/lcomm.2011.060111.102264